Fast Model Reduction of Parametric Systems using Subspace Recycling
نویسندگان
چکیده
A fast computation technique is proposed in this paper to speed up the process of model order reduction for parameterized systems. The key step and also the main computational load of many model order reduction methods is the computation of a projection matrix V which requires computing moment matrices of the systems. For computing each moment matrix, the solution of a linear system with multiple righthand sides is required. Usually, a considerable number of linear systems have to be solved when the system includes more than two parameters. If the original system is of very large size, solving all the linear systems occupies the most part of the computation for obtaining the reduced model. In this paper, a fast recycling algorithm is applied to solve the whole sequence of linear systems and is shown to be much more efficient than the standard solvers as well as a newly proposed recycling method from [10], [11]. By using the recycling algorithm, the process of generating the reduced model can therefore be significantly accelerated.
منابع مشابه
Recycling BiCGSTAB with an Application to Parametric Model Order Reduction
Krylov subspace recycling is a process for accelerating the convergence of sequences of linear systems. Based on this technique we have recently developed the recycling BiCG algorithm. We now generalize and extend this recycling theory to BiCGSTAB. Recycling BiCG focuses on efficiently solving sequences of dual linear systems, while the focus here is on efficiently solving sequences of single l...
متن کاملKrylov-subspace recycling via the POD-augmented conjugate-gradient algorithm
This work presents a new Krylov-subspace-recycling method for efficiently solving sequences of linear systems of equations characterized by a non-invariant symmetric-positive-definite matrix. As opposed to typical truncation strategies used in recycling such as deflation, we propose a truncation method inspired by goal-oriented proper orthogonal decomposition (POD) from model reduction. This id...
متن کاملModel Reduction for Time-Varying Descriptor Systems Using Krylov-Subspaces Projection Techniques
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملProjection-Based Model Reduction for Time-Varying Descriptor Systems Using Recycled Krylov Subspaces
We will present a projection approach for model reduction of linear time-varying descriptor systems based on earlier ideas in the work of Philips and others. The idea behind the proposed procedure is based on a multipoint rational approximation of the monodromy matrix of the corresponding differential-algebraic equation. This is realized by orthogonal projection onto a rational Krylov subspace....
متن کاملModel Order Reduction for Maxwell Equations based on Moment Matching
The numerical simulation of electromagnetic fields is a frequent and time-consuming task in many applications. The behavior of electromagnetic fields is typically described by the timedomain Maxwell equations of first order. These lead to large-scale time-dependent partial differential equations in three spatial dimensions. Often one is only interested in the input-output properties of this sys...
متن کامل